VECTIS Mesher - A 3D Cartesian Approach Employing Marching Cubes
نویسنده
چکیده
This paper describes the main principles used in the development of the VECTIS mesher. The mesher produces unstructured 3D meshes suitable for Finite Volume Methods. It is based on the Cartesian approach. In contrary to the traditional approaches which use exact shape of boundary faces of cut cells, this mesher employs Marching Cubes method for generation of majority of boundary faces. Only in problematic parts of the geometry, when the danger of chamfering of sharp features occurs or when watertightness of the cell might not be ensured, the Exact Fit method is used to produce the patches. Because two different methods are used for generation of patches, additional effort needs to be made to tie the boundary polygons to prevent gaps. A new algorithm for determining the most suitable configuration of triangles of Marching Cubes patterns is proposed. In cartesian meshers, a problematic situation occurs whenever triangles of the surface lay exactly on a side of the intersecting box. In order to prevent these collisions, an approach called Dual Levels has been introduced. The implemented method of cell refinement is presented. The paper also explains the way how the problem of cells that are too concave was resolved. The algorithm of the whole meshing task is described in detail. The new mesher has significantly lower time and memory demands in comparison with its predecessor. The main approaches responsible for this improvement are discussed.
منابع مشابه
A marching algorithm for isosurface extraction from face-centered cubic lattices
This work provides a novel method that extracts isosurfaces from face-centered cubic (FCC) lattices. It has been theoretically shown that sampling volumetric data on an FCC lattice tiled with rhombic dodecahedra is more efficient than sampling them on a Cartesian lattice tiled with cubes, in that the FCC lattice can represent the same data set as a Cartesian lattice with the same accuracy, yet ...
متن کاملCubical Marching Squares: Adaptive Feature Preserving Surface Extraction from Volume Data
In this paper, we present a new method for surface extraction from volume data which preserves sharp features, maintains consistent topology and generates surface adaptively without crack patching. Our approach is based on the marching cubes algorithm, a popular method to convert volumetric data to polygonal meshes. The original marching cubes algorithm suffers from problems of topological inco...
متن کاملShort Note A second-order fast marching eikonal solver
Unfortunately, first-order implementations lead to inaccuracies in computed traveltimes, which may lead to poor image focusing for migration applications. In addition, first-order traveltimes are not accurate enough for reliable amplitude calculations. This has lead to the development of the fast marching method on non-Cartesian (Alkhalifah and Fomel, 1997; Sun and Fomel, 1998), and even unstru...
متن کاملA second - order fast marching eikonal solver
Unfortunately, first-order implementations lead to inaccuracies in computed traveltimes, which may lead to poor image focusing for migration applications. In addition, first-order traveltimes are not accurate enough for reliable amplitude calculations. This has lead to the development of the fast marching method on non-Cartesian (Alkhalifah and Fomel, 1997; Sun and Fomel, 1998), and even unstru...
متن کاملIsosurfaces on Optimal Regular Samples
Volumetric samples on Cartesian lattices are less efficient than samples on body-centred cubic (BCC) lattices. We show how to construct isosurfaces on BCC lattices using several different algorithms. Since the mesh that arises from BCC lattices involves a large number of cells, we show two alternate methods of reducing the number of cells by clumping tetrahedra into either octahedra or hexahedr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009